<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/set_algorithms/disjoint_set/disjointset.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('disjointset_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">disjointset.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="disjointset_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef DISJOINTSET</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define DISJOINTSET</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&lt;memory&gt;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&lt;vector&gt;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;{</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keyword">namespace </span>SetAlgorithm</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    {</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html">   54</a></span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> KType&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html">DisjointSetNode</a></div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    {</div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a8f801679de129d80a99ad683430c534a">   56</a></span>&#160;        <span class="keyword">typedef</span> KType <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a8f801679de129d80a99ad683430c534a">KeyType</a>;  </div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a579c4ac62902b32c0bd04ccea02536ea">   65</a></span>&#160;        <span class="keyword">explicit</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a579c4ac62902b32c0bd04ccea02536ea">DisjointSetNode</a>(std::shared_ptr&lt;KeyType&gt;v):<a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ae01535aa5e8ba05dceedd5c475d61c18">value</a>(v){}</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div>
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ae01535aa5e8ba05dceedd5c475d61c18">   67</a></span>&#160;        std::weak_ptr&lt;KeyType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ae01535aa5e8ba05dceedd5c475d61c18">value</a>;</div>
<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a1fd137f74ca1317bfb02d9e1640ce147">   68</a></span>&#160;        <span class="keywordtype">int</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a1fd137f74ca1317bfb02d9e1640ce147">rank</a>;</div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ad5cf3f4d739ecd0c1f6d3b3005e21993">   69</a></span>&#160;        std::shared_ptr&lt;DisjointSetNode&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ad5cf3f4d739ecd0c1f6d3b3005e21993">parent</a>;</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div>
<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a85fa0b8f80ba6529936ba2103c68194c">   84</a></span>&#160;       <span class="keyword">static</span>  std::shared_ptr&lt;DisjointSetNode&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a85fa0b8f80ba6529936ba2103c68194c">find_set</a>(std::shared_ptr&lt;DisjointSetNode&gt;node)</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        {</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            <span class="keywordflow">if</span>(!node)</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;find_set error: node must not be nullptr!&quot;</span>);</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            <span class="keywordflow">if</span>(node-&gt;parent!=node)</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                node-&gt;parent=<a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a85fa0b8f80ba6529936ba2103c68194c">find_set</a>(node-&gt;parent);</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            <span class="keywordflow">return</span> node-&gt;parent;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        }</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div>
<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a7346337c6f47bf066844c7101058cd92">  100</a></span>&#160;        <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a7346337c6f47bf066844c7101058cd92">make_set</a>(std::shared_ptr&lt;DisjointSetNode&gt;node)</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        {</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            <span class="keywordflow">if</span>(node)</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            {</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;               node-&gt;parent=node;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;               node-&gt;rank=0;</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            }<span class="keywordflow">else</span></div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            {</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;make_set error: node must not be nullptr!&quot;</span>);</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;            }</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        }</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div>
<div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ac5fff2fa07d82ed04529aa9159d37efc">  124</a></span>&#160;        <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ac5fff2fa07d82ed04529aa9159d37efc">link_set</a>(std::shared_ptr&lt;DisjointSetNode&gt;nodeX,std::shared_ptr&lt;DisjointSetNode&gt;nodeY)</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;        {</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;            <span class="keywordflow">if</span>(!nodeX|| !nodeY)</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;            <span class="keywordflow">if</span>(nodeX!=nodeX-&gt;parent||nodeY!=nodeY-&gt;parent)</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;link_set error: node must be root of the set!&quot;</span>);</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordflow">if</span>(nodeX-&gt;rank&gt;nodeY-&gt;rank)</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            {</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                nodeY-&gt;parent=nodeX;</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;            }<span class="keywordflow">else</span></div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            {</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                nodeX-&gt;parent=nodeY;</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="keywordflow">if</span>(nodeX-&gt;rank==nodeY-&gt;rank)</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                {</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                    nodeY-&gt;rank++;</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                }</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;            }</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        }</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;</div>
<div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#aeb6281c8d6ec20987015fb1d1421b309">  151</a></span>&#160;        <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#aeb6281c8d6ec20987015fb1d1421b309">union_set</a>(std::shared_ptr&lt;DisjointSetNode&gt;nodeX,std::shared_ptr&lt;DisjointSetNode&gt;nodeY)</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;        {</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ac5fff2fa07d82ed04529aa9159d37efc">link_set</a>(<a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a85fa0b8f80ba6529936ba2103c68194c">find_set</a>(nodeX),<a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a85fa0b8f80ba6529936ba2103c68194c">find_set</a>(nodeY));</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        }</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    };</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;  }</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;}</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="preprocessor">#endif // DISJOINTSET</span></div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_aeb6281c8d6ec20987015fb1d1421b309"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#aeb6281c8d6ec20987015fb1d1421b309">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::union_set</a></div><div class="ttdeci">static void union_set(std::shared_ptr&lt; DisjointSetNode &gt;nodeX, std::shared_ptr&lt; DisjointSetNode &gt;nodeY)</div><div class="ttdoc">union_set：合并集合 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00151">disjointset.h:151</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_ae01535aa5e8ba05dceedd5c475d61c18"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ae01535aa5e8ba05dceedd5c475d61c18">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::value</a></div><div class="ttdeci">std::weak_ptr&lt; KeyType &gt; value</div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00067">disjointset.h:67</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_a7346337c6f47bf066844c7101058cd92"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a7346337c6f47bf066844c7101058cd92">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::make_set</a></div><div class="ttdeci">static void make_set(std::shared_ptr&lt; DisjointSetNode &gt;node)</div><div class="ttdoc">make_set：创建集合 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00100">disjointset.h:100</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_a8f801679de129d80a99ad683430c534a"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a8f801679de129d80a99ad683430c534a">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::KeyType</a></div><div class="ttdeci">KType KeyType</div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00056">disjointset.h:56</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_a579c4ac62902b32c0bd04ccea02536ea"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a579c4ac62902b32c0bd04ccea02536ea">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::DisjointSetNode</a></div><div class="ttdeci">DisjointSetNode(std::shared_ptr&lt; KeyType &gt;v)</div><div class="ttdoc">DisjointSetNode的显式构造函数 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00065">disjointset.h:65</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_a1fd137f74ca1317bfb02d9e1640ce147"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a1fd137f74ca1317bfb02d9e1640ce147">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::rank</a></div><div class="ttdeci">int rank</div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00068">disjointset.h:68</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode</a></div><div class="ttdoc">DisjointSetNode：不相交集合森林的节点，算法导论第21章21.3节 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00054">disjointset.h:54</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_ac5fff2fa07d82ed04529aa9159d37efc"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ac5fff2fa07d82ed04529aa9159d37efc">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::link_set</a></div><div class="ttdeci">static void link_set(std::shared_ptr&lt; DisjointSetNode &gt;nodeX, std::shared_ptr&lt; DisjointSetNode &gt;nodeY)</div><div class="ttdoc">link_set：链接集合 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00124">disjointset.h:124</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_a85fa0b8f80ba6529936ba2103c68194c"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#a85fa0b8f80ba6529936ba2103c68194c">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::find_set</a></div><div class="ttdeci">static std::shared_ptr&lt; DisjointSetNode &gt; find_set(std::shared_ptr&lt; DisjointSetNode &gt;node)</div><div class="ttdoc">find_set：返回结点所在集合的代表结点 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00084">disjointset.h:84</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_html"><div class="ttname"><a href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div><div class="ttdoc">Namespace of IntrodunctionToAlgorithm. </div><div class="ttdef"><b>Definition:</b> <a href="longest__common__subsequence_8h_source.html#l00024">longest_common_subsequence.h:24</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html_ad5cf3f4d739ecd0c1f6d3b3005e21993"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html#ad5cf3f4d739ecd0c1f6d3b3005e21993">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode::parent</a></div><div class="ttdeci">std::shared_ptr&lt; DisjointSetNode &gt; parent</div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00069">disjointset.h:69</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_0ebe04a029d2a003f5554846f5eef60c.html">set_algorithms</a></li><li class="navelem"><a class="el" href="dir_4b08b44a26a78dfc2b0efd68fb1ec5c4.html">disjoint_set</a></li><li class="navelem"><a class="el" href="disjointset_8h.html">disjointset.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
